if __name__ == "__main__":
f = open("input.txt", "r")
n = int(f.readline())
students = list(f.readline())
f = open("output.txt", "w")
for i in range(int(n/2)):
if i + int(n/2) <= n:
a = students[i]
b = students[i + int(n/2)]
arr = [[i + 1, a], [i + int(n/2) + 1, b]]
arr.sort(key=lambda x: x[1])
print(arr[0][0], arr[1][0], file=f)
else:
a = students[i]
b = students[i - int(n/2)]
arr = [[i + 1, a], [i - int(n/2) - 1, b]]
arr.sort(key=lambda x: x[1])
print(arr[0][0], arr[1][0], file=f)
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |
46. Permutations | 226. Invert Binary Tree |
112. Path Sum | 1556A - A Variety of Operations |
136. Single Number | 169. Majority Element |
119. Pascal's Triangle II | 409. Longest Palindrome |
1574A - Regular Bracket Sequences | 1574B - Combinatorics Homework |
1567A - Domino Disaster | 1593A - Elections |
1607A - Linear Keyboard | EQUALCOIN Equal Coins |
XOREQN Xor Equation | MAKEPAL Weird Palindrome Making |
HILLSEQ Hill Sequence | MAXBRIDGE Maximise the bridges |
WLDRPL Wildcard Replacement | 1221. Split a String in Balanced Strings |
1002. Find Common Characters | 1602A - Two Subsequences |
1555A - PizzaForces | 1607B - Odd Grasshopper |
1084A - The Fair Nut and Elevator | 1440B - Sum of Medians |